Duality

In this lesson we introduce the concept of duality in mathematical programming. First we define dual program and show that any optimization problem has a dual and that the dual of the dual is the primal. Next, we show how to obtain the dual of a given problem and provide rules to do it. We end with some illustrative examples that include the mill problem and the support vector machine problem.